On Growth Rates of Closed Permutation Classes
نویسندگان
چکیده
منابع مشابه
On Growth Rates of Closed Permutation Classes
A class of permutations Π is called closed if π ⊂ σ ∈ Π implies π ∈ Π, where the relation ⊂ is the natural containment of permutations. Let Πn be the set of all permutations of 1, 2, . . . , n belonging to Π. We investigate the counting functions n 7→ |Πn| of closed classes. Our main result says that if |Πn| < 2n−1 for at least one n ≥ 1, then there is a unique k ≥ 1 such that Fn,k ≤ |Πn| ≤ Fn,...
متن کاملOn growth rates of hereditary permutation classes
A class of permutations is called hereditary if implies where the relation is the natural containment of permutations Let n be the set of all permutations of n belonging to We investigate the counting functions n j nj of hereditary classes Our main result says that if j nj n for at least one n then there is a unique k such that Fn k j nj Fn k n c holds for all n with a constant c Here Fn k are ...
متن کاملGrowth rates of minor-closed classes of matroids
For a minor-closed class M of matroids, we let h(k) denote the maximum number of elements of a simple rank-k matroid in M. We prove that, if M does not contain all simple rank-2 matroids, then h(k) grows either linearly, quadratically, or exponentially.
متن کاملPermutation Classes of Polynomial Growth
A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterized as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and sufficient conditions on sets of forbidden permutations which ensure that the associated pattern class is of polynomial growth is determined. A catalogue all ...
متن کاملGrowth rates of permutation grid classes, tours on graphs, and the spectral radius
Monotone grid classes of permutations have proven very effective in helping to determine structural and enumerative properties of classical permutation pattern classes. Associated with grid class Grid(M) is a graph, G(M), known as its “row-column” graph. We prove that the exponential growth rate of Grid(M) is equal to the square of the spectral radius of G(M). Consequently, we utilize spectral ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2003
ISSN: 1077-8926
DOI: 10.37236/1682